منابع مشابه
Information Distance in Multiples
Information distance is a parameter-free similarity measure based on compression, used in pattern recognition, data mining, phylogeny, clustering, and classification. The notion of information distance is extended from pairs to multiples (finite lists). We study maximal overlap, metricity, universality, minimal overlap, additivity, and normalized information distance in multiples. We use the th...
متن کاملNormalized Compression Distance of Multiples
Normalized compression distance (NCD) is a parameter-free similarity measure based on compression. The NCD between pairs of objects is not sufficient for all applications. We propose an NCD of finite multisets (multiples) of objacts that is metric and is better for many applications. Previously, attempts to obtain such an NCD failed. We use the theoretical notion of Kolmogorov complexity that f...
متن کاملDistance graphs with missing multiples in the distance sets
Given positive integers m, k and s with m > ks, let Dm,k,s represent the set {1, 2, · · · ,m} − {k, 2k, · · · , sk}. The distance graph G(Z,Dm,k,s) has as vertex set all integers Z and edges connecting i and j whenever |i − j| ∈ Dm,k,s. The chromatic number and the fractional chromatic number of G(Z,Dm,k,s) are denoted by χ(Z,Dm,k,s) and χf (Z,Dm,k,s), respectively. For s = 1, χ(Z,Dm,k,1) was s...
متن کاملRelations between Renyi Distance and Fisher Information
In this paper, we first show that Renyi distance between any member of a parametric family and its perturbations, is proportional to its Fisher information. We, then, prove some relations between the Renyi distance of two distributions and the Fisher information of their exponentially twisted family of densities. Finally, we show that the partial ordering of families induced by Renyi dis...
متن کاملCircular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples
Given a set D of positive integers, the distance graph G(Z , D) has all integers as vertices, and two vertices are adjacent if and only if their difference is in D; that is, the vertex set is Z and the edge set is {uv : |u − v| ∈ D}. We call D the distance set. This paper studies chromatic and circular chromatic numbers of some distance graphs with certain distance sets. The circular chromatic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2110130